An Efficient Fully Symbolic Bisimulation Algorithm for Non-Deterministic Systems
نویسندگان
چکیده
The definition of bisimulation suggests a partition-refinement step, which we show to be suitable for a saturation-based implementation. We compare our fully symbolic saturation-based implementation with the fastest extant bisimulation algorithms over a set of benchmarks, and conclude that it appears to be the fastest algorithm capable of computing the largest bisimulation over very large quotient spaces.
منابع مشابه
A Fully Symbolic Bisimulation Algorithm
We apply the saturation heuristic to the bisimulation problem for deterministic discrete-event models, obtaining the fastest to date symbolic bisimulation algorithm, able to deal with large quotient spaces. We compare performance of our algorithm with that of Wimmer et al., on a collection of models. As the number of equivalence classes increases, our algorithm tends to have improved time and s...
متن کاملSaturation Heuristic for Faster Bisimulation with Petri Nets
Bisimilarity is an extensional notion of equivalence of states of an automata. A bisimulation is a set of such equivalences among the states of automata. The bisimulation problem is the task of deciding bisimilarity for all pairs of states of an automata. The present work applies the Saturation [15] heuristic and interleaved MDD partition representation to the bisimulation problem. Previous wor...
متن کاملRank-Based Symbolic Bisimulation (and Model Checking)
In this paper we propose an efficient symbolic algorithm for the problem of determining the maximum bisimulation on a finite structure. The starting point is an algorithm, on explicit representation of graphs, which saves both time and space exploiting the notion of rank. This notion provides a layering of the input model and allows to proceed bottom-up in the bisimulation computation. In this ...
متن کاملComputing strong and weak bisimulations for psi-calculi
We present a symbolic transition system and strong and weak bisimulationequivalences for psi-calculi, and show that they are fully abstract with respectto bisimulation congruences in the non-symbolic semantics. An algorithmwhich computes the most general constraint under which two agents arebisimilar is developed and proved correct.A psi-calculus is an extension of the p...
متن کاملDeciding Weak Weighted Bisimulation
Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid, subsuming a wide range of systems with quantitative aspects. In this paper we extend this theory towards other behavioural equivalences, by considering semirings of weights. Taking advantage of this extra structure, we consider a general notion of weak weighted bisimulation, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 2013